#include "..\CookHeader.h"

int SIZE;
Array <string> queue;
int front = 0, rear = 0;

bool isQueueFull() {
	if ( (rear+1)% SIZE == front )
		return true;
	else
		return false;
}

bool isQueueEmpty() {
	if (front == rear)
		return true;
	else
		return false;
}

void enQueue(string data) {
	if (isQueueFull()) {
		println("ť  áϴ.");
		return;
	}
	rear = (rear+1) % SIZE;
	queue[rear] = data;
}

string deQueue() {
	if (isQueueEmpty()) {
		println("ť ϴ.");
		return "None";
	}
	front = (front + 1) % SIZE;
	string data = queue[front];
	queue[front] = "None";
	return data;
}

string peek() {
	if (isQueueEmpty()) {
		println("ť ϴ.");
		return "None";
	}
	return queue[ (front + 1) % SIZE];
}

int main() {
	input(SIZE, "ť ũ⸦ Էϼ ==> ");
	for (int i = 0; i < SIZE; i++)
		queue.push_back("None");

	char select;
	input(select, "(I)/(E)/Ȯ(V)/(X)  ϳ  ==> ");

	string data;
	while (select != 'X' && select != 'x') {
		switch (select) {
		case 'I':
		case 'i':
			input(data, "Է --> ");
			enQueue(data);
			print("ť  : ");
			printArray(queue);
			println("front : " + to_string(front) + ", rear : " + to_string(rear));
			break;
		case 'E':
		case 'e':
			data = deQueue();
			println(" -->" + data);
			print("ť  : ");
			printArray(queue);
			println("front : " + to_string(front) + ", rear : " + to_string(rear));
			break;
		case 'V':
		case 'v':
			data = peek();
			println("   Ȯ-->" + data);
			printArray(queue);
			println("front : " + to_string(front) + ", rear : " + to_string(rear));
			break;
		default:
			println("Է ߸");
		}
		input(select, "(I)/(E)/Ȯ(V)/(X)  ϳ  ==> ");
	}
	println("α׷ !");
}